Product of Finite Maximal P-Codes
نویسندگان
چکیده
Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y of A such that the product XY being unambiguous, if XY is a semaphore code then X and Y are semaphore codes. Finally, two open problems to the product of finite semaphore and maximal infix codes are presented.
منابع مشابه
GRAY ISOMETRIES FOR FINITE p-GROUPS
We construct two classes of Gray maps, called type-I Gray map and type-II Gray map, for a finite p-group G. Type-I Gray maps are constructed based on the existence of a Gray map for a maximal subgroup H of G. When G is a semidirect product of two finite p-groups H and K, both H and K admit Gray maps and the corresponding homomorphism ψ : H −→ Aut(K) is compatible with the Gray map of K in a sen...
متن کاملMaximal subsets of pairwise non-commuting elements of some finite p-groups
Let G be a group. A subset X of G is a set of pairwise noncommuting elements if xy ̸= yx for any two distinct elements x and y in X. If |X| ≥ |Y | for any other set of pairwise non-commuting elements Y in G, then X is said to be a maximal subset of pairwise non-commuting elements. In this paper we determine the cardinality of a maximal subset of pairwise non-commuting elements in any non-abelian...
متن کاملNotes on Finite Maximal Infix Codes 1
The fact that every finite infix code is contained in a finite maximal infix code was given in 1994 by Ito and Thierrin. In this paper, we construct two kinds of maximal infix codes from a finite maximal infix code. Then we show that a finite infix code is a finite intersection of some finite maximal infix codes.
متن کاملMatrix-product structure of constacyclic codes over finite chain rings $\mathbb{F}_{p^m}[u]/\langle u^e\rangle$
Let m, e be positive integers, p a prime number, Fpm be a finite field of p elements and R = Fpm [u]/〈u 〉 which is a finite chain ring. For any ω ∈ R and positive integers k, n satisfying gcd(p, n) = 1, we prove that any (1+ωu)-constacyclic code of length pn over R is monomially equivalent to a matrix-product code of a nested sequence of p cyclic codes with length n over R and a p × p matrix Ap...
متن کاملRecent results on syntactic groups of codes
Finite permutation groups can be considered as building blocks of finite transformation monoids. Indeed, by the Krohn-Rhodes Theorem, any finite transformation monoid divides a semidirect product of permutation groups and three element transformation monoids. Given a transformation monoid M on a finite set, defined by a finite set of generators, it is in general non-trivial to obtain a descript...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Comput. Math.
دوره 79 شماره
صفحات -
تاریخ انتشار 2002